Fast Message Passing via the ALLCACHE Memory on KSR Computers
نویسنده
چکیده
A large body of applications have been built which use a message-passing style of inter-process communication. Thus, it is important to be able to support eecient message-passing even on shared-memory computers. Unfortunately, `direct' porting of message-passing packages to shared-memory computers invariably produces unacceptably poor performance. In this paper, we discuss schemes for eeciently implementing the primi-tives of two commonly-used message-passing packages { PVM and TCGMSG { through the ALLCACHE memory of KSR computers. First, we describe a generic interface for message-passing and buuering, and map the speciic calls of these two packages on to this generic interface. We then derive analytical results about the achievable bandwidth for message-passing via the shared ALLCACHE memory on KSR machines. Further, we describe a simple but widely-used benchmark called ping-pong, and report the performance of this benchmark on our implementation of each of the two message-passing packages. Finally, we suggest some new features to the system software on KSR machines which might support such packages more eeciently, and point out some drawbacks in the interfaces of the packages which hinder their eecient implementation on multiprocessors.
منابع مشابه
Experience with Implementing Timewarp on Shared Memory Computers
The use of shared memory computers to implement the TimeWarp algorithm for distributed discrete event simulation is discussed. Actual experience on an implementation for the KSR-1 is described and compared with another implementation on explicit message passing machines. Modifications necessary to achieve good speedup are described. Performance results on the KSR-1 and on the SPARCServer-1000 a...
متن کاملParallel FFT and Quick-Merge Sort on the Reflective Memory Networked Computers and a Cluster of Workstations
This paper is concerned with parallel FFT and Quick-Merge Sort. They are implemented on computers interconnected by VMIC 5579 reflective memory and a cluster of workstations (PCs) interconnected via Fast Ethernet. Message passing interface (MPI) parallel library is used for communication in a cluster of workstations. An improved parallel FFT is also presented to decrease an execution time in th...
متن کاملMessage-Passing Performance of Various Computers
This report compares the performance of di erent computer systems for basic message passing. Latency and bandwidth are measured on Convex, Cray, Fujitsu, IBM, Intel, KSR, Meiko, nCUBE, NEC, SGI, and TMC multiprocessors. Communication performance is contrasted with the computational power of each system. The comparison includes both shared and distributed memory computers as well as networked wo...
متن کاملThe performance of fast Givens rotations problem implemented with MPI extensions in multicomputers
In this paper, issues related to implementing an MPI version of the fast Givens rotations problem are investigated. We have chosen this algorithm because it has the feature of having no predictable communication pattern. Message Passing Interface (MPI) is an attempt to standardise the communication library for distributed memory computing systems. The message-passing paradigm is attractive beca...
متن کاملShared Virtual Memory and Message Passing Programming on a Finite Element Application
This paper describes the methods used and experiences made with implementing a nite element application on three diierent parallel computers with either message passing or shared virtual memory as the programming model. Designing a parallel nite element application using message-passing requires to nd a data domain decomposition to map data into the local memory of the processors. Since data ac...
متن کامل